import sys
from sys import stdin,stdout
from math import *
import math, random, operator
from itertools import product, permutations, combinations
from collections import deque, defaultdict, Counter
input=sys.stdin.readline
def gcd(a,b):
if b==0:return abs(a)
else:return gcd(b,a%b)
def hi():
a,b=map(int,input().split())
if gcd(a,b)==1:print('Finite')
else:print("Infinite")
if __name__=="__main__":
for _ in range(int(input())):hi()
//https://codeforces.com/contest/1245/problem/A
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if (b > a) {
swap(a,b);
}
if (b != 0) {
gcd(a % b, b);
} else {
return a;
}
}
int main()
{
int tests;
cin >> tests;
for (int i = 1; i <= tests; ++i) {
int a, b;
cin >> a >> b;
if (gcd(a, b) != 1) {
cout << "Infinite" << "\n";
} else {
cout << "Finite" << "\n";
}
}
}
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |